The indefinite zero-one quadratic problem
نویسندگان
چکیده
منابع مشابه
An Indefinite - Quadratic - Programming Model Fora Continuous - Production Problem
A model is presented for a problem of scheduling the lengths of N production periods on one machine, which will manufacture q products. The problem is to choose production periods so as to minimize the sum of inventory costs for the q products in the presence of given demands. Mathematically, the problem is one of minimizing an indefinite quadratic function subject to linear constraints. A nume...
متن کاملRewriting integer variables into zero-one variables: Some guidelines for the integer quadratic multi-knapsack problem
This paper is concerned with the integer quadratic multidimensional knapsack problem (QMKP) where the objective function is separable. Our objective is to determine which expansion technique of the integer variables is the most appropriate to solve (QMKP) to optimality using the upper bound method proposed by Quadri et al. (2007). To the best of our knowledge the upper bound method previously m...
متن کاملQuadratic Irrationals, Quadratic Ideals and Indefinite Quadratic Forms II
Let D = 1 be a positive non-square integer and let δ = √ D or 1+ √ D 2 be a real quadratic irrational with trace t = δ + δ and norm n = δδ. Let γ = P+δ Q be a quadratic irrational for positive integers P and Q. Given a quadratic irrational γ, there exist a quadratic ideal Iγ = [Q, δ + P ] and an indefinite quadratic form Fγ(x, y) = Q(x−γy)(x−γy) of discriminant Δ = t − 4n. In the first section,...
متن کاملAn improved linearization strategy for zero-one quadratic programming problems
We present a new linearized model for the zero-one quadratic programming problem, whose size is linear in terms of the number of variables in the original nonlinear problem. Our derivation yields three alternative reformulations, each varying in model size and tightness. We show that our models are at least as tight as the one recently proposed by Chaovalitwongse, Pardalos, and Prokopyev (Opera...
متن کاملA Tight Linearization Strategy for Zero-One Quadratic Programming Problems
In this paper, we present a new approach to linearizing zero-one quadratic minimization problem which has many applications in computer science and communications. Our algorithm is based on the observation that the quadratic term of zero-one variables has two equivalent piece-wise formulations, convex and concave cases. The convex piece-wise objective function and/or constraints play a great ro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1984
ISSN: 0166-218X
DOI: 10.1016/0166-218x(84)90111-2